基于马尔可夫过程的坦克火力随机对抗模型

根据小规模坦克火力对抗中所具有的马尔可夫性特点,将该过程视为离散状态、离散时间的马尔可夫随机过程(马尔可夫链),由此建立了坦克与反坦克武器系统之间一对一对抗的随机格斗模型,并给出双方获胜概率和平均对抗回合数的计算公式。最后通过实例验证了模型的有效性。该模型克服了轮流对抗不符合战场实际的缺点,为分队指挥员在射击策略的选择和分队火力运用上的快速决策提供了较为精确的量化依据。     

C2关系网络演化生成特性分析*

在网络中心作战背景下,为了探索"聚力前沿"(Power to the Edge)现实要求下的指挥控制(C2)关系动态演化规律,讨论了两种实元的加入策略模型:"信息最优加入"策略(BIMS)和"随机加入"策略(RMS):提出了信息资源利用率、信息资源命中率、信息传输有效率等三个指挥控制关系网络效能指标和一种加权评价方法.通过对仿真结果的分析,发现了BIMS策略下C2关系网络演化过程中存在的自组织、自适应现象,得出了BIMS策略下C2关系网络将具有无尺度网络特征这一结论.最后,比较了BIMS策略和RMS策略下的C2关系网效能和抗随机干扰能力,发现前者优于后者,而且BIMS策略下C2关系网具有逐渐优化的能力.     

基于支持向量机的功率变换器开关管开路故障诊断

提出一种基于支持向量机的功率变换器开关管开路故障诊断方法。利用支持向量机建立分类模型,模型以相电流功率谱为输入量,7种故障状态为输出量,选用高斯核,使用基于二叉树分类器的分类算法。将诊断结果与基于BP神经网络的诊断结果进行比较,结果表明基于支持向量机的分类器在功率变换器开关管开路故障诊断中具有更高的准确率和更好的泛化能力。     

装备维修性增长及其基本过程研究

为了解决当前装备的维修性问题，揭示维修性发展的一般规律，进行了维修性增长的研究。首先阐明了装备维修性形成与演变的一般规律，继而提出了维修性增长的概念，重点研究了维修性增长的内涵与增长的一般过程，最后对解决增长问题所需的模型进行了分类，为增长技术的深入研究奠定了基础。     

中国特色网络文化建设与大学生思想政治教育

随着网络技术的发展，网络文化也运用而生。网络文化的双面效应给高校的思想政治教育工作带来了新的挑战。本文在分析网络文化对大学生影响的基础上，提出构建中国特色的网络文化，推进大学生思想政治教育的思路和措施。     

On finding spanning eulerian subgraphs

In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.     

Approximation for the departure process of a queue in a network

A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods.